Verbose, Laconic or Just Right: A Simple Computational Model of Content Appropriateness under Length Constraints
نویسندگان
چکیده
Length constraints impose implicit requirements on the type of content that can be included in a text. Here we propose the first model to computationally assess if a text deviates from these requirements. Specifically, our model predicts the appropriate length for texts based on content types present in a snippet of constant length. We consider a range of features to approximate content type, including syntactic phrasing, constituent compression probability, presence of named entities, sentence specificity and intersentence continuity. Weights for these features are learned using a corpus of summaries written by experts and on high quality journalistic writing. During test time, the difference between actual and predicted length allows us to quantify text verbosity. We use data from manual evaluation of summarization systems to assess the verbosity scores produced by our model. We show that the automatic verbosity scores are significantly negatively correlated with manual content quality scores given to the summaries.
منابع مشابه
Operating Room Scheduling in Teaching Hospitals: A Novel Stochastic Optimization Model
Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...
متن کاملOptimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملThermohydrodynamic Characteristics of Journal Bearings Running under Turbulent Condition
A thermohydrodynamic (THD) analysis of turbulent flow in journal bearings is presented based on the computational fluid dynamic (CFD) techniques. The bearing has infinite length and operates under incompressible and steady conditions. In this analysis, the numerical solution of Navier-Stokes equations with the equations governing the kinetic energy of turbulence and the dissipation rate, couple...
متن کاملA Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...
متن کامل